An improved BASIC program to produce random samples without replacement

Accelerating weighted random sampling without replacement

Random sampling from discrete populations is one of the basic primitives in statistical computing. This article briefly introduces weighted and unweighted sampling with and without replacement. The case of weighted sampling without replacement appears to be most difficult to implement efficiently, which might be one reason why the R implementation performs slowly for large problem sizes. This p...

An effort to produce a homozygous dominant male-sterile cotton

An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples

We consider the problem of deterministically selecting s uniformly random diierent m-element subsets of f1; :::; kg. The only known lower bound for the time to solve this problem is the trivial (sm). The best two previously known solutions are of time O(sm 3 log m log log m) and O(s(k + m)), respectivly. In this paper we present an algorithm whose time comlexity is O(s 2 m 2 + sm 2 log m log lo...

An improved general amino acid replacement matrix.

Amino acid replacement matrices are an essential basis of protein phylogenetics. They are used to compute substitution probabilities along phylogeny branches and thus the likelihood of the data. They are also essential in protein alignment. A number of replacement matrices and methods to estimate these matrices from protein alignments have been proposed since the seminal work of Dayhoff et al. ...

MOLREP: an Automated Program for Molecular Replacement

MOLREP is an automated program for molecular replacement which utilizes effective new approaches in data processing and rotational and translational searching. These include an automatic choice of all parameters, scaling by Patterson origin peaks and sott resolution cutoff. One of the cornerstones of the program is an original full-symmetry translation function combined with a packing function....